Optimistic Deltas for WWW Latency Reduction
نویسندگان
چکیده
When a machine is connected to the Internet via a slow network, such as a 28.8 Kbps modem, the cumulative latency to communicate over the Internet to World Wide Web servers and then transfer documents over the slow network can be significant. We have built a system that optimistically transfers data that may be out of date, then sends either a subsequent confirmation that the data is current or a delta to change the older version to the current one. In addition, if both sides of the slow link already store the same older version, just the delta need be transferred to update it. Our mechanism is optimistic because it assumes that much of the time there will be sufficient idle time to transfer most or all of the older version before the newer version is available, and because it assumes that the changes between the two versions will be small relative to the actual document. Timings of retrievals of random URLs in the Internet support the former assumption, while experiments using a version repository of Web documents bear out the latter one. Performance measurements of the optimistic delta system demonstrate that deltas significantly reduce latency when both sides cache the old version, and optimistic deltas can reduce latency, to a lesser degree, when content-provider service times are in the range of seconds or longer.
منابع مشابه
We13 Latency Reduction via Client-side Piwfetching
The rapid growth of the WWW has inspired numerous techniques to reduce web latency. While some of these techniques have not been implemented because they either increase network rru$ic or require coaperation between tiers. recent studies cast a shndow on techniques already in use (e.g. proxy cachingl as U result of the increasingly dynamic aspects of the WWW. Znparticular, the prol$erration of ...
متن کاملAn Evaluation of CGI Traffic and its Effect on WWW Latency
The World Wide Web has continued to grow exponentially. Only the explosion of new products and features for the Web can match the growth of the Web itself. In the midst of the excitement over Java, CGI, and secure transmissions, measurement of the Web and its basic functionalities have been ignored. As the Web grows, so does users’ frustration with the latency in downloading documents. While th...
متن کاملOptimistic replication in HOPE
The growing imbalance between network latency and throughput is causing nodes in distributed systems to appear to be moving farther apart. Many distributed systems are turning to replication as a mechanism to make resources appear closer. However, maintaining one-copy consistency in a system containing replicated elements has proven diicult. In particular, the checks required to make consistent...
متن کاملOptimistic Aborts for Geo-distributed Transactions
Network latency can have a significant impact on the performance of transactional storage systems, particularly in wide area or geo-distributed deployments. To reduce latency, systems typically rely on a cache to service read-requests closer to the client. However, caches are not effective for write-heavy workloads, which have to be processed by the storage system in order to maintain serializa...
متن کاملInvestigating the Effects of Trees and Butterfly Barriers on the Performance of Optimistic GVT Algorithm
There is two approaches for handling timing constraints in a heterogeneous network; conservatives and optimistic algorithms. In optimistic algorithms, time constraints are allowed to be violated with the help of a time wrap algorithm. Global Virtue Time (GVT) is a necessary mechanism for implementing time wrap algorithm. Mattern [2] has introduced an algorithm for GVT based computation using a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997